PRISM

Benchmark
Model:consensus v.1 (MDP)
Parameter(s)N = 6, K = 2
Property:steps_min (exp-reward)
Invocation (default)
../fix-syntax ../prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 consensus.6.prism consensus.props --property steps_min -const K=2
Execution
Walltime:85.30441236495972s
Return code:0
Relative Error:0.00034355438198611113
Log
PRISM
=====

Version: 4.5.dev
Date: Fri Feb 26 15:08:57 CET 2021
Hostname: christopher
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 consensus.6.prism consensus.props --property steps_min -const K=2

Parsing model file "consensus.6.prism"...

Type:        MDP
Modules:     process1 process2 process3 process4 process5 process6 
Variables:   counter pc1 coin1 pc2 coin2 pc3 coin3 pc4 coin4 pc5 coin5 pc6 coin6 

Parsing properties file "consensus.props"...

5 properties:
(1) "c1": P>=1 [ F "finished" ]
(2) "c2": Pmin=? [ F "finished"&"all_coins_equal_1" ]
(3) "disagree": Pmax=? [ F "finished"&!"agree" ]
(4) "steps_max": R{"steps"}max=? [ F "finished" ]
(5) "steps_min": R{"steps"}min=? [ F "finished" ]

---------------------------------------------------------------------

Model checking: "steps_min": R{"steps"}min=? [ F "finished" ]
Model constants: K=2

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: K=2

Computing reachable states...

Reachability (BFS): 149 iterations in 0.06 seconds (average 0.000389, setup 0.00)

Time for model construction: 0.088 seconds.

Type:        MDP
States:      1258240 (1 initial)
Transitions: 6236736
Choices:     5008128

Transition matrix: 7075 nodes (3 terminal), 6236736 minterms, vars: 24r/24c/6nd

Prob0A: 49 iterations in 0.26 seconds (average 0.005327, setup 0.00)

Prob1E: 50 iterations in 0.29 seconds (average 0.005900, setup 0.00)

Warning: PRISM hasn't checked for zero-reward loops.
Your minimum rewards may be too low...

goal = 384, inf = 0, maybe = 1257856

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=1258240, nc=5007744, nnz=6236352, k=6] [95.3 MB]
Building sparse matrix (transition rewards)... [n=1258240, nc=5007744, nnz=0, k=6] [23.9 MB]
Creating vector for state rewards... [9.6 MB]
Creating vector for inf... [9.6 MB]
Allocating iteration vectors... [2 x 9.6 MB]
TOTAL: [157.6 MB]

Starting iterations...
Iteration 169: max relative diff=0.005055, 5.02 sec so far
Iteration 337: max relative diff=0.001883, 10.03 sec so far
Iteration 505: max relative diff=0.000932, 15.04 sec so far
Iteration 674: max relative diff=0.000512, 20.07 sec so far
Iteration 842: max relative diff=0.000296, 25.08 sec so far
Iteration 1010: max relative diff=0.000176, 30.09 sec so far
Iteration 1178: max relative diff=0.000106, 35.09 sec so far
Iteration 1346: max relative diff=0.000065, 40.10 sec so far
Iteration 1515: max relative diff=0.000040, 45.12 sec so far
Iteration 1683: max relative diff=0.000024, 50.13 sec so far
Iteration 1852: max relative diff=0.000015, 55.15 sec so far
Iteration 2020: max relative diff=0.000009, 60.16 sec so far
Iteration 2188: max relative diff=0.000006, 65.16 sec so far
Iteration 2356: max relative diff=0.000004, 70.19 sec so far
Iteration 2524: max relative diff=0.000002, 75.21 sec so far
Iteration 2692: max relative diff=0.000001, 80.22 sec so far

Iterative method: 2796 iterations in 84.29 seconds (average 0.029799, setup 0.97)

Value in the initial state: 431.851584506982

Time for model checking: 84.896 seconds.

Result: 431.851584506982 (value in the initial state)


Overall running time: 85.216 seconds.

---------------------------------------------------------------------

Note: There were 2 warnings during computation.